Empirically comparing the performance of blockchain's consensus algorithms
نویسندگان
چکیده
Blockchain-based audit systems suffer from low scalability and high message complexity. The root cause of these shortcomings is the use “Practical Byzantine Fault Tolerance” (PBFT) consensus protocol in those systems. Alternatives to PBFT have not been used blockchain-based due limited knowledge about their functional operational requirements. Currently, no blockchain testbed supports execution benchmarking different protocols a unified testing environment. This paper demonstrates building that five state-of-the-art system; namely PBFT, Proof-of-Work (PoW), Proof-of-Stake (PoS), Proof-of-Elapsed Time (PoET), Clique. Performance evaluation algorithms carried out using data real-world system. These results show Clique best suited for systems, based on features.
منابع مشابه
Comparing Distributed Consensus Algorithms∗
Protocols that solve agreement problems are essential building blocks for fault tolerant distributed systems. While many protocols have been published, little has been done to analyze their performance, especially the performance of their fault tolerance mechanisms. In this paper, we compare two consensus algorithms with different communication schemes: one is centralized and the other decentra...
متن کاملSoK: Consensus in the Age of Blockchains
The blockchain initially gained traction in 2008 as the technology underlying Bitcoin [105], but now has been employed in a diverse range of applications and created a global market worth over $150B as of 2017. What distinguishes blockchains from traditional distributed databases is the ability to operate in a decentralized setting without relying on a trusted third party. As such their core te...
متن کاملConsensus in the Age of Blockchains
The blockchain initially gained traction in 2008 as the technology underlying Bitcoin [104], but now has been employed in a diverse range of applications and created a global market worth over $150B as of 2017. What distinguishes blockchains from traditional distributed databases is the ability to operate in a decentralized setting without relying on a trusted third party. As such their core te...
متن کاملComparing the Performance of Two Consensus Algorithms with Centralized and Decentralized Communication Schemes
Protocols that solve agreement problems are essential building blocks for fault tolerant distributed systems. While many protocols have been published, little has been done to analyze their performance, especially the performance of their fault tolerance mechanisms. In this paper, we compare two consensus algorithms with different communication schemes: one is centralized and the other decentra...
متن کاملthe effects of time planning and task complexity on accuracy of narrative task performance
هدف اصلی این تحقیق بررسی تاثیر برنامه ریزی زمانی، هم چنین افزایش میزان پیچیدگی تکالیف در نظر گرفته شده بصورت همزمان، بر دقت و صحت و پیچیدگی عملکرد نوشتاری زبان آموزان می باشد. بدین منظور، 50 نفر از دانش آموزان دختر در رده ی سنی 16 الی 18 سال به عنوان شرکت کنندگان در این زمینه ی تحقیق در نظر گرفته شدند و به دو گروه آزمایشی و کنترل بصورت اتفاقی تقسیم شدند. اعضای گروه آزمایشی هر دو تکلیف ساده و پی...
ذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IET blockchain
سال: 2021
ISSN: ['2634-1573']
DOI: https://doi.org/10.1049/blc2.12007